0.03/0.12 % Problem : Vampire---4.8_8647 : TPTP v0.0.0. Released v0.0.0. 0.03/0.13 % Command : run_E %s %d THM 0.14/0.34 % Computer : n021.cluster.edu 0.14/0.34 % Model : x86_64 x86_64 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.14/0.34 % Memory : 8042.1875MB 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.14/0.34 % CPULimit : 1440 0.14/0.34 % WCLimit : 180 0.14/0.34 % DateTime : Mon Jul 3 13:10:07 EDT 2023 0.14/0.34 % CPUTime : 0.20/0.47 Running higher-order theorem provingRunning: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.kPOnrvQVpq/Vampire---4.8_8647 0.20/0.47 # Version: 3.1pre001-ho 0.20/0.49 # Preprocessing class: HSMSSMSSMLLNHSN. 0.20/0.49 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.20/0.49 # Starting new_ho_10_cnf2 with 900s (5) cores 0.20/0.49 # Starting post_as_ho3 with 180s (1) cores 0.20/0.49 # Starting new_ho_12 with 180s (1) cores 0.20/0.49 # Starting new_bool_2 with 180s (1) cores 0.20/0.49 # post_as_ho3 with pid 8826 completed with status 0 0.20/0.49 # Result found by post_as_ho3 0.20/0.49 # Preprocessing class: HSMSSMSSMLLNHSN. 0.20/0.49 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.20/0.49 # Starting new_ho_10_cnf2 with 900s (5) cores 0.20/0.49 # Starting post_as_ho3 with 180s (1) cores 0.20/0.49 # No SInE strategy applied 0.20/0.49 # Search class: HGHNS-FFMF33-SHSSMSBN 0.20/0.49 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 0.20/0.49 # Starting new_ho_10 with 98s (1) cores 0.20/0.49 # new_ho_10 with pid 8831 completed with status 0 0.20/0.49 # Result found by new_ho_10 0.20/0.49 # Preprocessing class: HSMSSMSSMLLNHSN. 0.20/0.49 # Scheduled 4 strats onto 8 cores with 180 seconds (1440 total) 0.20/0.49 # Starting new_ho_10_cnf2 with 900s (5) cores 0.20/0.49 # Starting post_as_ho3 with 180s (1) cores 0.20/0.49 # No SInE strategy applied 0.20/0.49 # Search class: HGHNS-FFMF33-SHSSMSBN 0.20/0.49 # Scheduled 6 strats onto 1 cores with 180 seconds (180 total) 0.20/0.49 # Starting new_ho_10 with 98s (1) cores 0.20/0.49 # Preprocessing time : 0.002 s 0.20/0.49 # Presaturation interreduction done 0.20/0.49 0.20/0.49 # Proof found! 0.20/0.49 # SZS status Theorem 0.20/0.49 # SZS output start CNFRefutation 0.20/0.49 thf(decl_25, type, mnot: ($i > $o) > $i > $o). 0.20/0.49 thf(decl_27, type, mand: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.49 thf(decl_28, type, mimplies: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.49 thf(decl_30, type, mequiv: ($i > $o) > ($i > $o) > $i > $o). 0.20/0.49 thf(decl_32, type, mforall_ind: (mu > $i > $o) > $i > $o). 0.20/0.49 thf(decl_33, type, mforall_indset: ((mu > $i > $o) > $i > $o) > $i > $o). 0.20/0.49 thf(decl_35, type, mexists_ind: (mu > $i > $o) > $i > $o). 0.20/0.49 thf(decl_38, type, mbox_generic: ($i > $i > $o) > ($i > $o) > $i > $o). 0.20/0.49 thf(decl_39, type, mdia_generic: ($i > $i > $o) > ($i > $o) > $i > $o). 0.20/0.49 thf(decl_40, type, rel: $i > $i > $o). 0.20/0.49 thf(decl_41, type, mbox: ($i > $o) > $i > $o). 0.20/0.49 thf(decl_42, type, mdia: ($i > $o) > $i > $o). 0.20/0.49 thf(decl_43, type, mvalid: ($i > $o) > $o). 0.20/0.49 thf(decl_45, type, positive: (mu > $i > $o) > $i > $o). 0.20/0.49 thf(decl_46, type, god: mu > $i > $o). 0.20/0.49 thf(decl_49, type, esk1_3: $i > (mu > $i > $o) > (mu > $i > $o) > $i). 0.20/0.49 thf(decl_50, type, esk2_3: $i > (mu > $i > $o) > (mu > $i > $o) > mu). 0.20/0.49 thf(decl_51, type, esk3_0: $i). 0.20/0.49 thf(decl_52, type, epred1_2: $i > mu > mu > $i > $o). 0.20/0.49 thf(decl_53, type, epred2_0: mu > $i > $o). 0.20/0.49 thf(decl_55, type, epred4_1: (mu > $i > $o) > mu > $i > $o). 0.20/0.49 thf(decl_56, type, epred5_2: $i > mu > mu > $i > $o). 0.20/0.49 thf(mdia_generic, axiom, ((mdia_generic)=(^[X15:$i > $i > $o, X4:$i > $o, X3:$i]:(?[X16:$i]:(((X15 @ X3 @ X16)&(X4 @ X16)))))), file('/export/starexec/sandbox2/tmp/tmp.kPOnrvQVpq/Vampire---4.8_8647', mdia_generic)). 0.20/0.49 thf(defD1, axiom, ((god)=(^[X1:mu]:(mforall_indset @ (^[X17:mu > $i > $o]:(mimplies @ (positive @ X17) @ (X17 @ X1)))))), file('/export/starexec/sandbox2/tmp/tmp.kPOnrvQVpq/Vampire---4.8_8647', defD1)). 0.20/0.49 thf(mimplies, axiom, ((mimplies)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:(((X4 @ X3)=>(X5 @ X3))))), file('/export/starexec/sandbox2/tmp/tmp.kPOnrvQVpq/Vampire---4.8_8647', mimplies)). 0.20/0.49 thf(mforall_indset, axiom, ((mforall_indset)=(^[X7:(mu > $i > $o) > $i > $o, X3:$i]:(![X8:mu > $i > $o]:((X7 @ X8 @ X3))))), file('/export/starexec/sandbox2/tmp/tmp.kPOnrvQVpq/Vampire---4.8_8647', mforall_indset)). 0.20/0.49 thf(mexists_ind, axiom, ((mexists_ind)=(^[X11:mu > $i > $o, X3:$i]:(?[X1:mu]:((X11 @ X1 @ X3))))), file('/export/starexec/sandbox2/tmp/tmp.kPOnrvQVpq/Vampire---4.8_8647', mexists_ind)). 0.20/0.49 thf(mdia, axiom, ((mdia)=(^[Z0/* 19 */:$i > $o, Z1:$i]:(?[X26:$i]:(((rel @ Z1 @ X26)&(Z0 @ X26)))))), file('/export/starexec/sandbox2/tmp/tmp.kPOnrvQVpq/Vampire---4.8_8647', mdia)). 0.20/0.49 thf(mvalid, axiom, ((mvalid)=(^[X4:$i > $o]:(![X3:$i]:((X4 @ X3))))), file('/export/starexec/sandbox2/tmp/tmp.kPOnrvQVpq/Vampire---4.8_8647', mvalid)). 0.20/0.49 thf(corC, conjecture, (mvalid @ (mdia @ (mexists_ind @ (^[X1:mu]:(god @ X1))))), file('/export/starexec/sandbox2/tmp/tmp.kPOnrvQVpq/Vampire---4.8_8647', corC)). 0.20/0.49 thf(mbox_generic, axiom, ((mbox_generic)=(^[X15:$i > $i > $o, X4:$i > $o, X3:$i]:(![X16:$i]:((~((X15 @ X3 @ X16))|(X4 @ X16)))))), file('/export/starexec/sandbox2/tmp/tmp.kPOnrvQVpq/Vampire---4.8_8647', mbox_generic)). 0.20/0.49 thf(mand, axiom, ((mand)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:(((X4 @ X3)&(X5 @ X3))))), file('/export/starexec/sandbox2/tmp/tmp.kPOnrvQVpq/Vampire---4.8_8647', mand)). 0.20/0.49 thf(mforall_ind, axiom, ((mforall_ind)=(^[X6:mu > $i > $o, X3:$i]:(![X1:mu]:((X6 @ X1 @ X3))))), file('/export/starexec/sandbox2/tmp/tmp.kPOnrvQVpq/Vampire---4.8_8647', mforall_ind)). 0.20/0.49 thf(mbox, axiom, ((mbox)=(^[Z0/* 19 */:$i > $o, Z1:$i]:(![X25:$i]:((~((rel @ Z1 @ X25))|(Z0 @ X25)))))), file('/export/starexec/sandbox2/tmp/tmp.kPOnrvQVpq/Vampire---4.8_8647', mbox)). 0.20/0.49 thf(axA3, axiom, (mvalid @ (positive @ god)), file('/export/starexec/sandbox2/tmp/tmp.kPOnrvQVpq/Vampire---4.8_8647', axA3)). 0.20/0.49 thf(mnot, axiom, ((mnot)=(^[X4:$i > $o, X3:$i]:(~((X4 @ X3))))), file('/export/starexec/sandbox2/tmp/tmp.kPOnrvQVpq/Vampire---4.8_8647', mnot)). 0.20/0.49 thf(mequiv, axiom, ((mequiv)=(^[X4:$i > $o, X5:$i > $o, X3:$i]:(((X4 @ X3)<=>(X5 @ X3))))), file('/export/starexec/sandbox2/tmp/tmp.kPOnrvQVpq/Vampire---4.8_8647', mequiv)). 0.20/0.49 thf(axA2, axiom, (mvalid @ (mforall_indset @ (^[X23:mu > $i > $o]:(mforall_indset @ (^[X24:mu > $i > $o]:(mimplies @ (mand @ (positive @ X23) @ (mbox @ (mforall_ind @ (^[X1:mu]:(mimplies @ (X23 @ X1) @ (X24 @ X1)))))) @ (positive @ X24))))))), file('/export/starexec/sandbox2/tmp/tmp.kPOnrvQVpq/Vampire---4.8_8647', axA2)). 0.20/0.49 thf(axA1, axiom, (mvalid @ (mforall_indset @ (^[X21:mu > $i > $o]:(mequiv @ (positive @ (^[X1:mu]:(mnot @ (X21 @ X1)))) @ (mnot @ (positive @ X21)))))), file('/export/starexec/sandbox2/tmp/tmp.kPOnrvQVpq/Vampire---4.8_8647', axA1)). 0.20/0.49 thf(c_0_17, plain, ((mdia_generic)=(^[Z0/* 19 */:$i > $i > $o, Z1:$i > $o, Z2:$i]:(?[X16:$i]:(((Z0 @ Z2 @ X16)&(Z1 @ X16)))))), inference(fof_simplification,[status(thm)],[mdia_generic])). 0.20/0.49 thf(c_0_18, plain, ((god)=(^[Z0/* 19 */:mu, Z1:$i]:(![X27:mu > $i > $o]:((((positive @ X27 @ Z1)=>(X27 @ Z0 @ Z1))))))), inference(fof_simplification,[status(thm)],[defD1])). 0.20/0.49 thf(c_0_19, plain, ((mimplies)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)=>(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies])). 0.20/0.49 thf(c_0_20, plain, ((mforall_indset)=(^[Z0/* 19 */:(mu > $i > $o) > $i > $o, Z1:$i]:(![X8:mu > $i > $o]:((Z0 @ X8 @ Z1))))), inference(fof_simplification,[status(thm)],[mforall_indset])). 0.20/0.49 thf(c_0_21, plain, ((mexists_ind)=(^[Z0/* 19 */:mu > $i > $o, Z1:$i]:(?[X1:mu]:((Z0 @ X1 @ Z1))))), inference(fof_simplification,[status(thm)],[mexists_ind])). 0.20/0.49 thf(c_0_22, axiom, ((mdia)=(^[Z0/* 19 */:$i > $o, Z1:$i]:(?[X26:$i]:(((rel @ Z1 @ X26)&(Z0 @ X26)))))), inference(apply_def,[status(thm)],[mdia, c_0_17])). 0.20/0.49 thf(c_0_23, plain, ((mvalid)=(^[Z0/* 6 */:$i > $o]:(![X3:$i]:((Z0 @ X3))))), inference(fof_simplification,[status(thm)],[mvalid])). 0.20/0.49 thf(c_0_24, plain, ((god)=(^[Z0/* 19 */:mu, Z1:$i]:(![X27:mu > $i > $o]:((((positive @ X27 @ Z1)=>(X27 @ Z0 @ Z1))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_18, c_0_19]), c_0_20])). 0.20/0.49 thf(c_0_25, negated_conjecture, ~(![X59:$i]:(?[X58:$i]:(((rel @ X59 @ X58)&?[X57:mu]:(![X56:mu > $i > $o]:(((positive @ X56 @ X58)=>(X56 @ X57 @ X58)))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[corC])]), c_0_21]), c_0_22]), c_0_23]), c_0_24])). 0.20/0.49 thf(c_0_26, plain, ((mbox_generic)=(^[Z0/* 19 */:$i > $i > $o, Z1:$i > $o, Z2:$i]:(![X16:$i]:((~((Z0 @ Z2 @ X16))|(Z1 @ X16)))))), inference(fof_simplification,[status(thm)],[mbox_generic])). 0.20/0.49 thf(c_0_27, plain, ![X91:$i, X92:mu, X93:mu > $i > $o, X94:$i, X95:mu]:(((~(epred2_0 @ X92 @ X91)|(~(positive @ X93 @ X91)|(X93 @ X92 @ X91)))&(((positive @ (epred5_2 @ X94 @ X95) @ X94)|(epred2_0 @ X95 @ X94))&(~(epred5_2 @ X94 @ X95 @ X95 @ X94)|(epred2_0 @ X95 @ X94))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[])])])])])])). 0.20/0.49 thf(c_0_28, negated_conjecture, ![X73:$i, X74:mu]:((((positive @ (epred1_2 @ X73 @ X74) @ X73)|~(rel @ esk3_0 @ X73))&(~(epred1_2 @ X73 @ X74 @ X74 @ X73)|~(rel @ esk3_0 @ X73)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])])])])). 0.20/0.49 thf(c_0_29, plain, ((mand)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)&(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mand])). 0.20/0.49 thf(c_0_30, plain, ((mforall_ind)=(^[Z0/* 19 */:mu > $i > $o, Z1:$i]:(![X1:mu]:((Z0 @ X1 @ Z1))))), inference(fof_simplification,[status(thm)],[mforall_ind])). 0.20/0.49 thf(c_0_31, axiom, ((mbox)=(^[Z0/* 19 */:$i > $o, Z1:$i]:(![X25:$i]:((~((rel @ Z1 @ X25))|(Z0 @ X25)))))), inference(apply_def,[status(thm)],[mbox, c_0_26])). 0.20/0.49 thf(c_0_32, plain, ![X38:$i]:((positive @ (^[Z0/* 19 */:mu, Z1:$i]:(![X37:mu > $i > $o]:(((positive @ X37 @ Z1)=>(X37 @ Z0 @ Z1))))) @ X38)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[axA3, c_0_23]), c_0_24])). 0.20/0.49 thf(c_0_33, plain, ((mnot)=(^[Z0/* 19 */:$i > $o, Z1:$i]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot])). 0.20/0.49 thf(c_0_34, plain, ((mequiv)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o, Z2:$i]:(((Z0 @ Z2)<=>(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mequiv])). 0.20/0.49 thf(c_0_35, plain, ![X1:mu, X6:mu > $i > $o, X3:$i]:(((X6 @ X1 @ X3)|~((epred2_0 @ X1 @ X3))|~((positive @ X6 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_27])). 0.20/0.49 thf(c_0_36, negated_conjecture, ![X1:mu, X3:$i]:(((positive @ (epred1_2 @ X3 @ X1) @ X3)|~((rel @ esk3_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_28])). 0.20/0.49 thf(c_0_37, plain, ![X55:$i, X54:mu > $i > $o, X53:mu > $i > $o]:((((positive @ X54 @ X55)&![X52:$i]:((~(rel @ X55 @ X52)|![X51:mu]:(((X54 @ X51 @ X52)=>(X53 @ X51 @ X52))))))=>(positive @ X53 @ X55))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[axA2]), c_0_29]), c_0_19]), c_0_30]), c_0_20]), c_0_31]), c_0_23])])). 0.20/0.49 thf(c_0_38, plain, ![X60:$i]:((positive @ (^[Z0/* 19 */:mu, Z1:$i]:(![X37:mu > $i > $o]:(((positive @ X37 @ Z1)=>(X37 @ Z0 @ Z1))))) @ X60)), inference(variable_rename,[status(thm)],[c_0_32])). 0.20/0.49 thf(c_0_39, plain, ![X78:$i, X77:mu]:(((epred2_0 @ X77 @ X78)<=>![X76:mu > $i > $o]:(((positive @ X76 @ X78)=>(X76 @ X77 @ X78))))), introduced(definition)). 0.20/0.49 thf(c_0_40, plain, ![X47:$i, X46:mu > $i > $o]:(((positive @ (^[Z0/* 19 */:mu, Z1:$i]:(~((X46 @ Z0 @ Z1)))) @ X47)<=>~(positive @ X46 @ X47))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[axA1]), c_0_33]), c_0_34]), c_0_20]), c_0_23])])). 0.20/0.49 thf(c_0_41, negated_conjecture, ![X1:mu, X3:$i]:((~((epred1_2 @ X3 @ X1 @ X1 @ X3))|~((rel @ esk3_0 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_28])). 0.20/0.49 thf(c_0_42, negated_conjecture, ![X1:mu, X2:mu, X3:$i]:(((epred1_2 @ X3 @ X1 @ X2 @ X3)|~((rel @ esk3_0 @ X3))|~((epred2_0 @ X2 @ X3)))), inference(spm,[status(thm)],[c_0_35, c_0_36])). 0.20/0.49 thf(c_0_43, plain, ![X67:$i, X68:mu > $i > $o, X69:mu > $i > $o]:((((rel @ X67 @ (esk1_3 @ X67 @ X68 @ X69))|~(positive @ X68 @ X67)|(positive @ X69 @ X67))&(((X68 @ (esk2_3 @ X67 @ X68 @ X69) @ (esk1_3 @ X67 @ X68 @ X69))|~(positive @ X68 @ X67)|(positive @ X69 @ X67))&(~(X69 @ (esk2_3 @ X67 @ X68 @ X69) @ (esk1_3 @ X67 @ X68 @ X69))|~(positive @ X68 @ X67)|(positive @ X69 @ X67))))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_37])])])])). 0.20/0.49 thf(c_0_44, plain, ![X3:$i]:((((positive @ epred2_0 @ X3))=(($true)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_38]), c_0_39])). 0.20/0.49 thf(c_0_45, plain, ![X62:$i, X63:mu > $i > $o]:(((~(positive @ (^[Z0/* 19 */:mu, Z1:$i]:(~((X63 @ Z0 @ Z1)))) @ X62)|~(positive @ X63 @ X62))&((positive @ X63 @ X62)|(positive @ (^[Z0/* 19 */:mu, Z1:$i]:(~((X63 @ Z0 @ Z1)))) @ X62)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_40])])). 0.20/0.49 thf(c_0_46, plain, ![X88:$i, X87:mu, X6:mu > $i > $o]:(((epred4_1 @ X6 @ X87 @ X88)<=>~((X6 @ X87 @ X88)))), introduced(definition)). 0.20/0.49 thf(c_0_47, negated_conjecture, ![X1:mu, X3:$i]:((~((rel @ esk3_0 @ X3))|~((epred2_0 @ X1 @ X3)))), inference(spm,[status(thm)],[c_0_41, c_0_42])). 0.20/0.49 thf(c_0_48, plain, ![X8:mu > $i > $o, X6:mu > $i > $o, X3:$i]:(((X6 @ (esk2_3 @ X3 @ X6 @ X8) @ (esk1_3 @ X3 @ X6 @ X8))|(positive @ X8 @ X3)|~((positive @ X6 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_43])). 0.20/0.49 thf(c_0_49, plain, ![X3:$i]:((positive @ epred2_0 @ X3)), inference(cn,[status(thm)],[c_0_44])). 0.20/0.49 thf(c_0_50, plain, ![X6:mu > $i > $o, X3:$i]:((~((((positive @ (epred4_1 @ X6) @ X3))=(($true))))|~((positive @ X6 @ X3)))), inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_45]), c_0_46])). 0.20/0.49 thf(c_0_51, negated_conjecture, ![X3:$i, X6:mu > $i > $o]:(((positive @ X6 @ X3)|~((rel @ esk3_0 @ (esk1_3 @ X3 @ epred2_0 @ X6))))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47, c_0_48]), c_0_49])])). 0.20/0.49 thf(c_0_52, plain, ![X8:mu > $i > $o, X6:mu > $i > $o, X3:$i]:(((rel @ X3 @ (esk1_3 @ X3 @ X6 @ X8))|(positive @ X8 @ X3)|~((positive @ X6 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_43])). 0.20/0.49 thf(c_0_53, plain, ![X6:mu > $i > $o, X3:$i]:((~((positive @ (epred4_1 @ X6) @ X3))|~((positive @ X6 @ X3)))), inference(cn,[status(thm)],[c_0_50])). 0.20/0.49 thf(c_0_54, negated_conjecture, ![X6:mu > $i > $o]:((positive @ X6 @ esk3_0)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51, c_0_52]), c_0_49])])). 0.20/0.49 thf(c_0_55, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53, c_0_54]), c_0_54])]), ['proof']). 0.20/0.49 # SZS output end CNFRefutation 0.20/0.49 # Parsed axioms : 59 0.20/0.49 # Removed by relevancy pruning/SinE : 0 0.20/0.49 # Initial clauses : 51 0.20/0.49 # Removed in clause preprocessing : 28 0.20/0.49 # Initial clauses in saturation : 23 0.20/0.49 # Processed clauses : 58 0.20/0.49 # ...of these trivial : 0 0.20/0.49 # ...subsumed : 0 0.20/0.49 # ...remaining for further processing : 58 0.20/0.49 # Other redundant clauses eliminated : 0 0.20/0.49 # Clauses deleted for lack of memory : 0 0.20/0.49 # Backward-subsumed : 1 0.20/0.49 # Backward-rewritten : 0 0.20/0.49 # Generated clauses : 42 0.20/0.49 # ...of the previous two non-redundant : 33 0.20/0.49 # ...aggressively subsumed : 0 0.20/0.49 # Contextual simplify-reflections : 0 0.20/0.49 # Paramodulations : 42 0.20/0.49 # Factorizations : 0 0.20/0.49 # NegExts : 0 0.20/0.49 # Equation resolutions : 0 0.20/0.49 # Total rewrite steps : 6 0.20/0.49 # Propositional unsat checks : 0 0.20/0.49 # Propositional check models : 0 0.20/0.49 # Propositional check unsatisfiable : 0 0.20/0.49 # Propositional clauses : 0 0.20/0.49 # Propositional clauses after purity: 0 0.20/0.49 # Propositional unsat core size : 0 0.20/0.49 # Propositional preprocessing time : 0.000 0.20/0.49 # Propositional encoding time : 0.000 0.20/0.49 # Propositional solver time : 0.000 0.20/0.49 # Success case prop preproc time : 0.000 0.20/0.49 # Success case prop encoding time : 0.000 0.20/0.49 # Success case prop solver time : 0.000 0.20/0.49 # Current number of processed clauses : 34 0.20/0.49 # Positive orientable unit clauses : 3 0.20/0.49 # Positive unorientable unit clauses: 0 0.20/0.49 # Negative unit clauses : 0 0.20/0.49 # Non-unit-clauses : 31 0.20/0.49 # Current number of unprocessed clauses: 21 0.20/0.49 # ...number of literals in the above : 90 0.20/0.49 # Current number of archived formulas : 0 0.20/0.49 # Current number of archived clauses : 24 0.20/0.49 # Clause-clause subsumption calls (NU) : 152 0.20/0.49 # Rec. Clause-clause subsumption calls : 81 0.20/0.49 # Non-unit clause-clause subsumptions : 1 0.20/0.49 # Unit Clause-clause subsumption calls : 15 0.20/0.49 # Rewrite failures with RHS unbound : 0 0.20/0.49 # BW rewrite match attempts : 0 0.20/0.49 # BW rewrite match successes : 0 0.20/0.49 # Condensation attempts : 58 0.20/0.49 # Condensation successes : 0 0.20/0.49 # Termbank termtop insertions : 5365 0.20/0.49 0.20/0.49 # ------------------------------------------------- 0.20/0.49 # User time : 0.010 s 0.20/0.49 # System time : 0.004 s 0.20/0.49 # Total time : 0.014 s 0.20/0.49 # Maximum resident set size: 2140 pages 0.20/0.49 0.20/0.49 # ------------------------------------------------- 0.20/0.49 # User time : 0.011 s 0.20/0.49 # System time : 0.007 s 0.20/0.49 # Total time : 0.018 s 0.20/0.49 # Maximum resident set size: 1784 pages 0.20/0.49 % E---3.1 exiting 0.20/0.49 EOF